The Cost of Bounded Curvature

We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations σ, σ′, let `(σ, σ′) be the shortest bounded-curvature path from σ to σ′. For d > 0, let `(d) be the supremum of `(σ, σ′), over all pairs (σ, σ′) that are at Euclidean distance d. We study the function dub(d) = `(d) − d, which expresses the difference between the bounded-curvature path length and the Euclidean distance of its endpoints. We show that dub(d) decreases monotonically from dub(0) = 7π/3 to dub(d∗) = 2π, and is constant for d > d∗. Here d∗ ≈ 1.5874. We describe pairs of configurations that exhibit the worst-case of dub(d) for every distance d.